Strengthened chain theorems for different versions of 4-connectivity
نویسندگان
چکیده
The chain theorem of Tutte states that every 3-connected graph can be constructed from a wheel Wn by repeatedly adding edges and splitting vertices. It is not difficult to prove the following strengthening this theorem: non-wheel W4 In paper, we similarly strengthen several theorems for various versions 4-connectivity.
منابع مشابه
analysis of ruin probability for insurance companies using markov chain
در این پایان نامه نشان داده ایم که چگونه می توان مدل ریسک بیمه ای اسپیرر اندرسون را به کمک زنجیره های مارکوف تعریف کرد. سپس به کمک روش های آنالیز ماتریسی احتمال برشکستگی ، میزان مازاد در هنگام برشکستگی و میزان کسری بودجه در زمان وقوع برشکستگی را محاسبه کرده ایم. هدف ما در این پایان نامه بسیار محاسباتی و کاربردی تر از روش های است که در گذشته برای محاسبه این احتمال ارائه شده است. در ابتدا ما نشا...
15 صفحه اولStrengthened Corticosubcortical Functional Connectivity during Muscle Fatigue
The present study examined functional connectivity (FC) between functional MRI (fMRI) signals of the primary motor cortex (M1) and each of the three subcortical neural structures, cerebellum (CB), basal ganglia (BG), and thalamus (TL), during muscle fatigue using the quantile regression technique. Understanding activation relation between the subcortical structures and the M1 during prolonged m...
متن کاملOn linear versions of some addition theorems
Let K ⊂ L be a field extension. Given K-subspaces A,B of L, we study the subspace 〈AB〉 spanned by the product set AB = {ab | a ∈ A, b ∈ B}. We obtain some lower bounds on dimK〈AB〉 and dimK〈B 〉 in terms of dimK A, dimK B and n. This is achieved by establishing linear versions of constructions and results in additive number theory mainly due to Kemperman and Olson.
متن کاملOn Complemented Versions of James’s Distortion Theorems
Examples are given to show that two natural questions asked in [5] about complemented versions of James’s distortion theorems have negative answers.
متن کاملConstructive Versions of Tarskγs Fixed Point Theorems
Let F be a monotone operator on the complete lattice L into itself. Tarski's lattice theoretical fixed point theorem states that the set of fixed points of F is a nonempty complete lattice for the ordering of L. We give a constructive proof of this theorem showing that the set of fixed points of F is the image of L by a lower and an upper preclosure operator. These preclosure operators are the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2023
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2022.113129